Shannon-Theoretic Limits on Noisy Compressive Sampling
نویسندگان
چکیده
منابع مشابه
Spread Spectrum Watermark Design under Noisy Compressive Sampling
This paper proposes an algorithm for spread spectrum watermark design under compressive sampling (CS) attack using hybridization of genetic algorithm (GA) and neural network. In watermarking application, CS may be viewed as a typical fading-like attack operation on the watermarked image. GA is used to determine the watermark strength taking into consideration of both robustness and imperceptibi...
متن کاملComment on "Asymptotic Achievability of the Cramér-Rao Bound for Noisy Compressive Sampling"
In [1], we proved the asymptotic achievability of the Cramér-Rao bound in the compressive sensing setting in the linear sparsity regime. In the proof, we used an erroneous closed-form expression of ασ for the genie-aided Cramér-Rao bound σTr(AIAI) −1 from Lemma 3.5, which appears in Eqs. (20) and (29). The proof, however, holds if one avoids replacing σTr(AIAI) −1 by the expression of Lemma 3.5...
متن کاملIs "Shannon-capacity of noisy computing" zero?
Towards understanding energy requirements for computation with noisy elements, we consider the computation of an arbitrary k-input, k-output binary invertible function. In our model, not all gates need to be noisy. However, the input nodes on the computation graph must be separated from the output nodes by a noisy cut. For this setup, we show that for the “information-friction” model proposed r...
متن کاملInterpolating Generalized Shannon Sampling Series
This paper deals with approximations by the interpolating generalized Shannon sampling series.
متن کامل3: the Shannon Sampling Theorem
In this final set of notes, we would like to end where we began. In the first set of notes, we mentioned that mathematics could be used to show how CDs and MP3s can reproduce our music well, even though the file sizes of MP3s are relatively small. In this set of notes, we attempt to describe how this is possible. Surprisingly, the exponential function will play a key role. We assume familiarity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2009.2034796